Computation Time In BMR
نویسنده
چکیده
Figure 13: Running time of the assembly DGEMM routine vs that of the C routine of the S-method coupled with DGEMM on single processor. MINDIM=100 for the S-method. Strassen's algorithm has been presented and compared with other parallel matrix multiplication algorithms. On the Intel iPSC/860, the BMR-Strassen method coupled with assembly BLAS routines o ers the fastest approach to matrix multiplication. When the communication is not very costly compared to computation, the Strassen-BMR method may o er a faster approach. Strassen-BMR method also requires less additional space than BMR-Strassen method.
منابع مشابه
Efficient Scalable Constant-Round MPC via Garbled Circuits
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, there has been tremendous progress towards making secure computation practical, with great success in the two-party case. In contrast, in the multiparty case, progress has been much slower, even for th...
متن کاملMore Efficient Constant-Round Multi-party Computation from BMR and SHE
We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry’s Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al (CRYPTO 2015). Our protocol avoids various inefficiencies of the previous two protocols. Compared to Gentry’s protocol we only require Somewha...
متن کاملPhenotypic flexibility in the basal metabolic rate of laughing doves: responses to short-term thermal acclimation.
Many birds exhibit considerable phenotypic flexibility in maintenance energy requirements, and up- or downregulate basal metabolic rate (BMR) over time scales of days to weeks during thermal acclimation. However, the extent to which individual birds can reverse the direction of BMR adjustments over short time scales remains unknown. In this study, we examined metabolic responses to short-term t...
متن کاملE cient Constant Round Multi-Party Computation Combining BMR and SPDZ
Abstract. Recently, there has been huge progress in the field of concretely e cient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely e cient fully-secure protocols, such ...
متن کاملEfficient Constant Round Multi-party Computation Combining BMR and SPDZ
Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007